Call Routing with Continuous Uncertainties
نویسنده
چکیده
Abstract This paper considers call routing in a telecommunications network. The network demands are assumed to be driven by Brownian motions and call routing takes place either directly or alternatively via an intermediate node. The expected routing processes and blocking probabilities are solved in terms of trivariate normal distributions. We consider the effects of demand uncertainty levels and their correlations on call routing and illustrate our model with a numerical example. Further, we show how our model can be used with a usual call routing method.
منابع مشابه
Balanced routing of random calls
We consider an online routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to d random two-link routes between the two endpoints of a call, via an intermediate node, and assigns the call to the first route with spare capacity on each link, if there is such a route. The balance...
متن کاملMathematical analysis and pricing of the European continuous installment call option
In this paper we consider the European continuous installment call option. Then its linear complementarity formulation is given. Writing the resulted problem in variational form, we prove the existence and uniqueness of its weak solution. Finally finite element method is applied to price the European continuous installment call option.
متن کاملRobust Agent Based Distribution System Restoration with Uncertainty in Loads in Smart Grids
This paper presents a comprehensive robust distributed intelligent control for optimum self-healing activities in smart distribution systems considering the uncertainty in loads. The presented agent based framework obviates the requirements for a central control method and improves the reliability of the self-healing mechanism. Agents possess three characteristics including local views, decentr...
متن کاملSpace OSPF: An Area Hierarchic Routing Protocol for Routers in Motion
[Abstract] The research presents a routing protocol for exchange of routing information among vastly spread routers which may also be in continuous motion. We call it Space OSPF. The proposed protocol uses trajectory and supports calculation of approximated optimum path routing tables ahead of time or on-demand withstanding topological changes due to continuous motion. Since the trajectory of s...
متن کاملFair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
In a call center, there is a natural trade-off between minimizing customer wait time and fairly dividing the workload amongst agents of different skill levels. The relevant control is the routing policy; that is, the decision concerning which agent should handle an arriving call when more than one agent is available. We formulate an optimization problem for a call center with heterogeneous agen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002